Spider Diagrams Augmented with Constants: A Complete System
نویسنده
چکیده
The use of visual languages in computing is varied, ranging from system modelling to the display of data analyzed in computation processes. A prominent example of a visual notation is the Unified Modelling Language (UML), designed for use by software engineers. Constraint diagrams were proposed as an alternative to the UML’s Object Constraint Language. Spider diagrams form a fragment of constraint diagrams, and their applications are more broad than just placing constraints on software models, including information visualization and displaying the results of database queries. This paper focuses on spider diagrams augmented with constants that represent specific individuals. We present a sound reasoning system for spider diagrams with constants and establish completeness. Furthermore, the technique used to prove completeness can be adapted to give rise to a decision procedure.
منابع مشابه
On the Completeness of Spider Diagrams Augmented with Constants
Diagrammatic reasoning can be described formally by a number of diagrammatic logics; spider diagrams are one of these, and are used for expressing logical statements about set membership and containment. Here, existing work on spider diagrams is extended to include constant spiders that represent specific individuals. We give a formal syntax and semantics for the extended diagram language befor...
متن کاملSingular Propositions and their Negations in Diagrams
This paper deals with the visual representation of negation involving particular propositions. The underlying consideration depends on the three basic desirable aspects of visual representation viz. simplicity, visual clarity and expressiveness [9]. For incorporation of constants in diagrams we discuss Venn-i (2004), Swoboda’s diagrams (2005) and Spider diagrams with constants (2005). We also d...
متن کاملReasoning with constraint diagrams
There is a range of visual languages which express logical statements, for example Euler diagrams. The effective use of such languages relies on knowledge about whether a diagram is contradictory and whether reasoning can be performed to transform one diagram into another. It is also desirable to know the expressiveness of such languages. Knowing what a language can and cannot express is import...
متن کاملA Sound and Complete Diagrammatic Reasoning System
Simple spider diagrams are a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They extend the systems of Venn-Peirce diagrams investigated by Shin to include lower bounds for the cardinalities of the sets represented by the diagrams. This paper summarises the main syntax and semantics of simple spider diagrams and ...
متن کاملWhat Can Spider Diagrams Say?
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalent in expressive power to the spider diagram language. The language ESD is monadic and includes equality but has no constants or function symbols. To show this equivalence, in one direction, for each diagram we constru...
متن کامل